|
The Canberra distance is a numerical measure of the distance between pairs of points in a vector space, introduced in 1966 and refined in 1967 by G. N. Lance and W. T. Williams. It is a weighted version of ''L''₁ (Manhattan) distance.〔Jurman G, Riccadonna S, Visintainer R, Furlanello C: Canberra Distance on Ranked Lists. In Proceedings, Advances in Ranking – NIPS 09 Workshop Edited by Agrawal S, Burges C, Crammer K. 2009, 22–27.〕 The Canberra distance has been used as a metric for comparing ranked lists〔 and for intrusion detection in computer security.〔Syed Masum Emran and Nong Ye (2002). Robustness of chi-square and Canberra distance metrics for computer intrusion detection. ''Quality and Reliability Engineering International'' 18:19–28.〕 == Definition == The Canberra distance ''d'' between vectors p and q in an ''n''-dimensional real vector space is given as follows: : where : are vectors. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Canberra distance」の詳細全文を読む スポンサード リンク
|